COMPRESS MULTIPLE CIPHERTEXTS USING ELGAMAL ENCRYPTION SCHEMES
نویسندگان
چکیده
منابع مشابه
Compress Multiple Ciphertexts Using ElGamal Encryption Schemes
In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze s...
متن کاملMalware encryption schemes - rerandomizable ciphertexts encrypted using environmental keys
Protecting malware using encryption prevents an analyst, defending some computer(s) in the network, from analyzing the malicious code and identifying the intentions of the malware author [4, 5]. We discuss malware encryption schemes that use environmental encryption keys [11], generated from some computer(s) the malware author intends to attack, and is able to rerandomize [2, 8] ciphertexts, to...
متن کاملThreshold Encryption into Multiple Ciphertexts
We propose (T,N) multi-ciphertext scheme for symmetric encryption. The scheme encrypts a message into N distinct ciphertexts. The knowledge of the symmetric key allows decryption of the original message from any ciphertext. Moreover, knowing T + 1 ciphertexts allows efficient recovery of the original message without the key, and without revealing the key as well. We define the security property...
متن کاملHow to Compress Homomorphic Ciphertexts
In typical applications of homomorphic encryption, the first step consists for Alice to encrypt some plaintext m under Bob’s public key pk and to send the ciphertext c = HEpk(m) to some third-party evaluator Charlie. This paper specifically considers that first step, i.e. the problem of transmitting c as efficiently as possible from Alice to Charlie. As previously noted, a form of compression i...
متن کاملEncoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves
At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed a very elegant technique over cyclic subgroups of Fp eliminating the need to encode the message as a group element in the ElGamal encryption scheme. Unfortunately, it is unclear how to adapt their scheme over elliptic curves. In a previous attempt, Virat suggested an adaptation of ElGamal to elliptic curves over the ring of dual ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Mathematical Society
سال: 2013
ISSN: 0304-9914
DOI: 10.4134/jkms.2013.50.2.361